Statistical mechanics of the lattice sphere packing problem.
نویسنده
چکیده
We present an efficient Monte Carlo method for the lattice sphere packing problem in d dimensions. We use this method to numerically discover de novo the densest lattice sphere packing in dimensions 9 through 20. Our method goes beyond previous methods, not only in exploring higher dimensions but also in shedding light on the statistical mechanics underlying the problem in question. We observe evidence of a phase transition in the thermodynamic limit d→∞. In the dimensions explored in the present work, the results are consistent with a first-order crystallization transition but leave open the possibility that a glass transition is manifested in higher dimensions.
منابع مشابه
Reformulation of the covering and quantizer problems as ground states of interacting particles.
It is known that the sphere-packing problem and the number-variance problem (closely related to an optimization problem in number theory) can be posed as energy minimizations associated with an infinite number of point particles in d-dimensional Euclidean space R(d) interacting via certain repulsive pair potentials. We reformulate the covering and quantizer problems as the determination of the ...
متن کاملEfficient linear programming algorithm to generate the densest lattice sphere packings.
Finding the densest sphere packing in d-dimensional Euclidean space R(d) is an outstanding fundamental problem with relevance in many fields, including the ground states of molecular systems, colloidal crystal structures, coding theory, discrete geometry, number theory, and biological systems. Numerically generating the densest sphere packings becomes very challenging in high dimensions due to ...
متن کاملLocal Covering Optimality of Lattices : Leech Lattice versus Root Lattice E 8
The Leech lattice is the exceptional lattice in dimension 24. Soon after its discovery by Leech [9], it was conjectured that it is extremal for several geometric problems in R: the kissing number problem, the sphere packing problem, and the sphere covering problem. In 1979, Odlyzko and Sloane and independently Levenshtein solved the kissing number problem in dimension 24 by showing that the Lee...
متن کاملThe sphere packing problem
Hales, T.C., The sphere packing problem, Journal of Computational and Applied Mathematics 44 (1992) 41-76. The sphere packing problem asks whether any packing of spheres of equal radius in three dimensions has density exceeding that of the face-centered-cubic lattice packing (of density IT/V%). This paper sketches a solution to this problem.
متن کاملRandom perfect lattices and the sphere packing problem.
Motivated by the search for best lattice sphere packings in Euclidean spaces of large dimensions we study randomly generated perfect lattices in moderately large dimensions (up to d=19 included). Perfect lattices are relevant in the solution of the problem of lattice sphere packing, because the best lattice packing is a perfect lattice and because they can be generated easily. Their number, how...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Physical review. E, Statistical, nonlinear, and soft matter physics
دوره 87 6 شماره
صفحات -
تاریخ انتشار 2013